package SwordFingerOffer;

public class Q10_1_Fib {

    public int fib(int n) {


        if (n < 2){
            return n == 0 ? 0 : 1;
        }

        int[] dp = new int[n + 1];
        dp[0] = 0;
        dp[1] = 1;

        for (int i = 2; i <= n; i++) {
            //题目要求
            dp[i] = ( dp[i - 1] + dp[i - 2]) % 1000000007;

        }
        return dp[n];

    }
}
